Bounds for flag codes
نویسندگان
چکیده
The application of flags to network coding has been introduced recently by Liebhold, Nebe, and Vazquez-Castro. It is a variant random linear explicit routing solutions for given networks. Here we study lower upper bounds the maximum possible cardinality corresponding flag code with parameters.
منابع مشابه
Bounds for Signature Codes
We discuss upper and lower bounds of zero error capacity for signature coding models based on the symmetric noiseless multiple access channel.
متن کاملBounds for spherical codes
A set C of unit vectors in R is called an L-spherical code if x ·y ∈ L for any distinct x, y in C. Spherical codes have been extensively studied since their introduction in the 1970’s by Delsarte, Goethals and Seidel. In this note we prove a conjecture of Bukh on the maximum size of spherical codes. In particular, we show that for any set of k fixed angles, one can choose at most O(d) lines in ...
متن کاملAsymptotic bounds for spherical codes
The set of all error–correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square [0, 1] with coordinates (R(C), δ(C)):= (relative transmission rate, relative minimal distance). The central problem of the theory of such codes consists in maximising simultaneously the transmission rate of the code and the relative minimum Hamming distanc...
متن کاملDistance bounds for convolutional codes and some optimal codes
After a discussion of the Griesmer and Heller bound for the distance of a convolutional code we present several codes with various parameters, over various fields, and meeting the given distance bounds. Moreover, the Griesmer bound is used for deriving a lower bound for the field size of an MDS convolutional code and examples are presented showing that, in most cases, the lower bound is tight. ...
متن کاملCoset bounds for algebraic geometric codes
For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A− C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a party A that can recover the secret in an algebraic geometric linear secret sharing scheme with adversary threshold C, and (2) lower bounds for the support A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2021
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-021-00953-w